Extensions to the Rippling-Out Tactic for Guiding Inductive Proofs
نویسندگان
چکیده
Citation for published version: Bundy, A, van Harmelen, F, Smaill, A & Ireland, A 1990, Extensions to the Rippling-Out Tactic for Guiding Inductive Proofs. in 10th International Conference on Automated Deduction: Kaiserslautern, FRG, July 24–27, 1990 Proceedings. vol. Lecture Notes in Artificial Intelligence No. 449, Lecture Notes in Computer Science, vol. 449, Springer-Verlag GmbH, pp. 132-146. DOI: 10.1007/3-540-52885-7_84
منابع مشابه
Rippling: A Heuristic for Guiding Inductive Proofs
We describe rippling: a tactic for the heuristic control of the key part of proofs by mathematical induction. This tactic signiicantly reduces the search for a proof of a wide variety of inductive theorems. We rst present a basic version of rippling, followed by various extensions which are necessary to capture larger classes of inductive proofs. Finally, we present a general-ised form of rippl...
متن کاملThe Use of Proof Plans to Sum Series
We describe a program for nding closed form solutions to nite sums. The program was built to test the applicability of the proof planning search control technique in a domain of mathematics outwith induction. This experiment was successful. The series summing program extends previous work in this area and was built in a short time just by providing new series summing methods to our existing ind...
متن کاملAutomating Inductive Specification Proofs
We present an automatic method which combines logical proof search and rippling heuristics to prove specifications. The key idea is to instantiate meta-variables in the proof with a simultaneous match based on rippling/reverse rippling heuristic. Underlying our rippling strategy is the rippling distance strategy which introduces a new powerful approach to rippling, as it avoids termination prob...
متن کاملGuiding Proof Search in Logical Frameworks with Rippling
We present a new approach to search guidance for logics presented within a Logical Framework. This approach is based on the idea of rippling, as used in 4] to guide the search for inductive proofs and, more recently, in some non-inductive domains as well. We present our ideas with respect to the Edinburgh Logical Framework (LF) style of representation of logics but conjecture that our approach ...
متن کاملAutomating Inductive Speciication Proofs in Nuprl
We present an automatic method which combines logical proof search and rippling heuristics to prove speciications. The key idea is to instantiate meta-variables in the proof with a simultaneous match based on rippling/reverse rippling heuristic. Underlying our rippling strategy is the rippling distance strategy which introduces a new powerful approach to rippling, as it avoids termination probl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1990